TSTP Solution File: SET017^1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SET017^1 : TPTP v8.1.2. Released v3.6.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n028.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sun May 5 09:02:52 EDT 2024
% Result : Theorem 0.12s 0.34s
% Output : Refutation 0.12s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.10 % Problem : SET017^1 : TPTP v8.1.2. Released v3.6.0.
% 0.05/0.11 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.12/0.31 % Computer : n028.cluster.edu
% 0.12/0.31 % Model : x86_64 x86_64
% 0.12/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.31 % Memory : 8042.1875MB
% 0.12/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.31 % CPULimit : 300
% 0.12/0.31 % WCLimit : 300
% 0.12/0.31 % DateTime : Fri May 3 16:48:07 EDT 2024
% 0.12/0.32 % CPUTime :
% 0.12/0.32 This is a TH0_THM_EQU_NAR problem
% 0.12/0.32 Running vampire_ho --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_hol --cores 8 -m 12000 -t 300 /export/starexec/sandbox/tmp/tmp.5sqm0qH1xY/Vampire---4.8_30646
% 0.12/0.33 % (30760)lrs+1002_1:128_aac=none:au=on:cnfonf=lazy_not_gen_be_off:sos=all:i=2:si=on:rtra=on_0 on Vampire---4 for (2999ds/2Mi)
% 0.12/0.33 % (30762)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on Vampire---4 for (2999ds/18Mi)
% 0.12/0.33 % (30759)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on Vampire---4 for (2999ds/2Mi)
% 0.12/0.33 % (30758)dis+1010_1:1_au=on:cbe=off:chr=on:fsr=off:hfsq=on:nm=64:sos=theory:sp=weighted_frequency:i=27:si=on:rtra=on_0 on Vampire---4 for (2999ds/27Mi)
% 0.12/0.33 % (30756)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on Vampire---4 for (2999ds/183Mi)
% 0.12/0.33 % (30763)lrs+10_1:1_bet=on:cnfonf=off:fd=off:hud=5:inj=on:i=3:si=on:rtra=on_0 on Vampire---4 for (2999ds/3Mi)
% 0.12/0.33 % (30760)Instruction limit reached!
% 0.12/0.33 % (30760)------------------------------
% 0.12/0.33 % (30760)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.12/0.33 % (30761)lrs+1002_1:1_au=on:bd=off:e2e=on:sd=2:sos=on:ss=axioms:i=275:si=on:rtra=on_0 on Vampire---4 for (2999ds/275Mi)
% 0.12/0.33 % (30760)Termination reason: Unknown
% 0.12/0.33 % (30760)Termination phase: shuffling
% 0.12/0.33
% 0.12/0.33 % (30760)Memory used [KB]: 895
% 0.12/0.33 % (30760)Time elapsed: 0.002 s
% 0.12/0.33 % (30760)Instructions burned: 2 (million)
% 0.12/0.33 % (30760)------------------------------
% 0.12/0.33 % (30760)------------------------------
% 0.12/0.33 % (30757)lrs+10_1:1_c=on:cnfonf=conj_eager:fd=off:fe=off:kws=frequency:spb=intro:i=4:si=on:rtra=on_0 on Vampire---4 for (2999ds/4Mi)
% 0.12/0.33 % (30759)Instruction limit reached!
% 0.12/0.33 % (30759)------------------------------
% 0.12/0.33 % (30759)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.12/0.33 % (30759)Termination reason: Unknown
% 0.12/0.33 % (30759)Termination phase: Property scanning
% 0.12/0.33
% 0.12/0.33 % (30759)Memory used [KB]: 1023
% 0.12/0.33 % (30759)Time elapsed: 0.003 s
% 0.12/0.33 % (30759)Instructions burned: 3 (million)
% 0.12/0.33 % (30759)------------------------------
% 0.12/0.33 % (30759)------------------------------
% 0.12/0.34 % (30763)Instruction limit reached!
% 0.12/0.34 % (30763)------------------------------
% 0.12/0.34 % (30763)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.12/0.34 % (30763)Termination reason: Unknown
% 0.12/0.34 % (30763)Termination phase: Saturation
% 0.12/0.34
% 0.12/0.34 % (30763)Memory used [KB]: 1023
% 0.12/0.34 % (30763)Time elapsed: 0.003 s
% 0.12/0.34 % (30763)Instructions burned: 3 (million)
% 0.12/0.34 % (30763)------------------------------
% 0.12/0.34 % (30763)------------------------------
% 0.12/0.34 % (30757)Instruction limit reached!
% 0.12/0.34 % (30757)------------------------------
% 0.12/0.34 % (30757)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.12/0.34 % (30757)Termination reason: Unknown
% 0.12/0.34 % (30757)Termination phase: Saturation
% 0.12/0.34
% 0.12/0.34 % (30757)Memory used [KB]: 5500
% 0.12/0.34 % (30757)Time elapsed: 0.003 s
% 0.12/0.34 % (30757)Instructions burned: 4 (million)
% 0.12/0.34 % (30757)------------------------------
% 0.12/0.34 % (30757)------------------------------
% 0.12/0.34 % (30762)First to succeed.
% 0.12/0.34 % (30758)Also succeeded, but the first one will report.
% 0.12/0.34 % (30762)Refutation found. Thanks to Tanya!
% 0.12/0.34 % SZS status Theorem for Vampire---4
% 0.12/0.34 % SZS output start Proof for Vampire---4
% 0.12/0.34 thf(func_def_0, type, in: $i > ($i > $o) > $o).
% 0.12/0.34 thf(func_def_2, type, is_a: $i > ($i > $o) > $o).
% 0.12/0.34 thf(func_def_3, type, emptyset: $i > $o).
% 0.12/0.34 thf(func_def_4, type, unord_pair: $i > $i > $i > $o).
% 0.12/0.34 thf(func_def_5, type, singleton: $i > $i > $o).
% 0.12/0.34 thf(func_def_6, type, union: ($i > $o) > ($i > $o) > $i > $o).
% 0.12/0.34 thf(func_def_7, type, excl_union: ($i > $o) > ($i > $o) > $i > $o).
% 0.12/0.34 thf(func_def_8, type, intersection: ($i > $o) > ($i > $o) > $i > $o).
% 0.12/0.34 thf(func_def_9, type, setminus: ($i > $o) > ($i > $o) > $i > $o).
% 0.12/0.34 thf(func_def_10, type, complement: ($i > $o) > $i > $o).
% 0.12/0.34 thf(func_def_11, type, disjoint: ($i > $o) > ($i > $o) > $o).
% 0.12/0.34 thf(func_def_12, type, subset: ($i > $o) > ($i > $o) > $o).
% 0.12/0.34 thf(func_def_13, type, meets: ($i > $o) > ($i > $o) > $o).
% 0.12/0.34 thf(func_def_14, type, misses: ($i > $o) > ($i > $o) > $o).
% 0.12/0.34 thf(func_def_32, type, ph4: !>[X0: $tType]:(X0)).
% 0.12/0.34 thf(f92,plain,(
% 0.12/0.34 $false),
% 0.12/0.34 inference(subsumption_resolution,[],[f91,f89])).
% 0.12/0.34 thf(f89,plain,(
% 0.12/0.34 (sK2 != sK0)),
% 0.12/0.34 inference(backward_demodulation,[],[f61,f86])).
% 0.12/0.34 thf(f86,plain,(
% 0.12/0.34 (sK0 = sK1)),
% 0.12/0.34 inference(subsumption_resolution,[],[f85,f61])).
% 0.12/0.34 thf(f85,plain,(
% 0.12/0.34 (sK2 = sK1) | (sK0 = sK1)),
% 0.12/0.34 inference(equality_resolution,[],[f77])).
% 0.12/0.34 thf(f77,plain,(
% 0.12/0.34 ( ! [X1 : $i] : ((sK1 != X1) | (sK0 = X1) | (sK2 = X1)) )),
% 0.12/0.34 inference(equality_proxy_clausification,[],[f76])).
% 0.12/0.34 thf(f76,plain,(
% 0.12/0.34 ( ! [X1 : $i] : ((sK1 != X1) | ((sK2 = X1) = $true) | (sK0 = X1)) )),
% 0.12/0.34 inference(equality_proxy_clausification,[],[f72])).
% 0.12/0.34 thf(f72,plain,(
% 0.12/0.34 ( ! [X1 : $i] : ((sK0 = X1) | ($false = (sK1 = X1)) | ((sK2 = X1) = $true)) )),
% 0.12/0.34 inference(binary_proxy_clausification,[],[f71])).
% 0.12/0.34 thf(f71,plain,(
% 0.12/0.34 ( ! [X1 : $i] : (($false = ((sK0 = X1) | (sK1 = X1))) | ((sK2 = X1) = $true) | (sK0 = X1)) )),
% 0.12/0.34 inference(equality_proxy_clausification,[],[f70])).
% 0.12/0.34 thf(f70,plain,(
% 0.12/0.34 ( ! [X1 : $i] : (((sK0 = X1) = $true) | ((sK2 = X1) = $true) | ($false = ((sK0 = X1) | (sK1 = X1)))) )),
% 0.12/0.34 inference(binary_proxy_clausification,[],[f69])).
% 0.12/0.34 thf(f69,plain,(
% 0.12/0.34 ( ! [X1 : $i] : (($true = ((sK0 = X1) | (sK2 = X1))) | ($false = ((sK0 = X1) | (sK1 = X1)))) )),
% 0.12/0.34 inference(binary_proxy_clausification,[],[f67])).
% 0.12/0.34 thf(f67,plain,(
% 0.12/0.34 ( ! [X1 : $i] : ((((sK0 = X1) | (sK1 = X1)) = ((sK0 = X1) | (sK2 = X1)))) )),
% 0.12/0.34 inference(beta_eta_normalization,[],[f66])).
% 0.12/0.34 thf(f66,plain,(
% 0.12/0.34 ( ! [X1 : $i] : ((((^[Y0 : $i]: ((sK0 = Y0) | (sK2 = Y0))) @ X1) = ((^[Y0 : $i]: ((sK0 = Y0) | (sK1 = Y0))) @ X1))) )),
% 0.12/0.34 inference(argument_congruence,[],[f65])).
% 0.12/0.34 thf(f65,plain,(
% 0.12/0.34 ((^[Y0 : $i]: ((sK0 = Y0) | (sK1 = Y0))) = (^[Y0 : $i]: ((sK0 = Y0) | (sK2 = Y0))))),
% 0.12/0.34 inference(beta_eta_normalization,[],[f64])).
% 0.12/0.34 thf(f64,plain,(
% 0.12/0.34 (((^[Y0 : $i]: ((^[Y1 : $i]: ((^[Y2 : $i]: ((Y0 = Y2) | (Y1 = Y2))))))) @ sK0 @ sK2) = ((^[Y0 : $i]: ((^[Y1 : $i]: ((^[Y2 : $i]: ((Y0 = Y2) | (Y1 = Y2))))))) @ sK0 @ sK1))),
% 0.12/0.34 inference(definition_unfolding,[],[f60,f52,f52])).
% 0.12/0.34 thf(f52,plain,(
% 0.12/0.34 (unord_pair = (^[Y0 : $i]: ((^[Y1 : $i]: ((^[Y2 : $i]: ((Y0 = Y2) | (Y1 = Y2))))))))),
% 0.12/0.34 inference(cnf_transformation,[],[f21])).
% 0.12/0.34 thf(f21,plain,(
% 0.12/0.34 (unord_pair = (^[Y0 : $i]: ((^[Y1 : $i]: ((^[Y2 : $i]: ((Y0 = Y2) | (Y1 = Y2))))))))),
% 0.12/0.34 inference(fool_elimination,[],[f20])).
% 0.12/0.34 thf(f20,plain,(
% 0.12/0.34 (unord_pair = (^[X0 : $i, X1 : $i, X2 : $i] : ((X1 = X2) | (X0 = X2))))),
% 0.12/0.34 inference(rectify,[],[f4])).
% 0.12/0.34 thf(f4,axiom,(
% 0.12/0.34 (unord_pair = (^[X0 : $i, X2 : $i, X3 : $i] : ((X2 = X3) | (X0 = X3))))),
% 0.12/0.34 file('/export/starexec/sandbox/tmp/tmp.5sqm0qH1xY/Vampire---4.8_30646',unord_pair)).
% 0.12/0.34 thf(f60,plain,(
% 0.12/0.34 ((unord_pair @ sK0 @ sK1) = (unord_pair @ sK0 @ sK2))),
% 0.12/0.34 inference(cnf_transformation,[],[f46])).
% 0.12/0.34 thf(f46,plain,(
% 0.12/0.34 (sK2 != sK1) & ((unord_pair @ sK0 @ sK1) = (unord_pair @ sK0 @ sK2))),
% 0.12/0.34 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f44,f45])).
% 0.12/0.34 thf(f45,plain,(
% 0.12/0.34 ? [X0,X1,X2] : ((X1 != X2) & ((unord_pair @ X0 @ X2) = (unord_pair @ X0 @ X1))) => ((sK2 != sK1) & ((unord_pair @ sK0 @ sK1) = (unord_pair @ sK0 @ sK2)))),
% 0.12/0.34 introduced(choice_axiom,[])).
% 0.12/0.34 thf(f44,plain,(
% 0.12/0.34 ? [X0,X1,X2] : ((X1 != X2) & ((unord_pair @ X0 @ X2) = (unord_pair @ X0 @ X1)))),
% 0.12/0.34 inference(ennf_transformation,[],[f43])).
% 0.12/0.34 thf(f43,plain,(
% 0.12/0.34 ~! [X0,X1,X2] : (((unord_pair @ X0 @ X2) = (unord_pair @ X0 @ X1)) => (X1 = X2))),
% 0.12/0.34 inference(rectify,[],[f16])).
% 0.12/0.34 thf(f16,negated_conjecture,(
% 0.12/0.34 ~! [X0,X2,X4] : (((unord_pair @ X0 @ X2) = (unord_pair @ X0 @ X4)) => (X2 = X4))),
% 0.12/0.34 inference(negated_conjecture,[],[f15])).
% 0.12/0.34 thf(f15,conjecture,(
% 0.12/0.34 ! [X0,X2,X4] : (((unord_pair @ X0 @ X2) = (unord_pair @ X0 @ X4)) => (X2 = X4))),
% 0.12/0.34 file('/export/starexec/sandbox/tmp/tmp.5sqm0qH1xY/Vampire---4.8_30646',thm)).
% 0.12/0.34 thf(f61,plain,(
% 0.12/0.34 (sK2 != sK1)),
% 0.12/0.34 inference(cnf_transformation,[],[f46])).
% 0.12/0.34 thf(f91,plain,(
% 0.12/0.34 (sK2 = sK0)),
% 0.12/0.34 inference(equality_resolution,[],[f90])).
% 0.12/0.34 thf(f90,plain,(
% 0.12/0.34 ( ! [X1 : $i] : ((sK2 != X1) | (sK0 = X1)) )),
% 0.12/0.34 inference(duplicate_literal_removal,[],[f88])).
% 0.12/0.34 thf(f88,plain,(
% 0.12/0.34 ( ! [X1 : $i] : ((sK2 != X1) | (sK0 = X1) | (sK0 = X1)) )),
% 0.12/0.34 inference(backward_demodulation,[],[f84,f86])).
% 0.12/0.34 thf(f84,plain,(
% 0.12/0.34 ( ! [X1 : $i] : ((sK1 = X1) | (sK0 = X1) | (sK2 != X1)) )),
% 0.12/0.34 inference(equality_proxy_clausification,[],[f81])).
% 0.12/0.34 thf(f81,plain,(
% 0.12/0.34 ( ! [X1 : $i] : ((sK1 = X1) | ($false = (sK2 = X1)) | (sK0 = X1)) )),
% 0.12/0.34 inference(binary_proxy_clausification,[],[f80])).
% 0.12/0.34 thf(f80,plain,(
% 0.12/0.34 ( ! [X1 : $i] : (($false = ((sK0 = X1) | (sK2 = X1))) | (sK1 = X1) | (sK0 = X1)) )),
% 0.12/0.34 inference(equality_proxy_clausification,[],[f79])).
% 0.12/0.34 thf(f79,plain,(
% 0.12/0.34 ( ! [X1 : $i] : ((sK0 = X1) | ((sK1 = X1) = $true) | ($false = ((sK0 = X1) | (sK2 = X1)))) )),
% 0.12/0.34 inference(equality_proxy_clausification,[],[f78])).
% 0.12/0.34 thf(f78,plain,(
% 0.12/0.34 ( ! [X1 : $i] : (((sK0 = X1) = $true) | ($false = ((sK0 = X1) | (sK2 = X1))) | ((sK1 = X1) = $true)) )),
% 0.12/0.34 inference(binary_proxy_clausification,[],[f68])).
% 0.12/0.34 thf(f68,plain,(
% 0.12/0.34 ( ! [X1 : $i] : ((((sK0 = X1) | (sK1 = X1)) = $true) | ($false = ((sK0 = X1) | (sK2 = X1)))) )),
% 0.12/0.34 inference(binary_proxy_clausification,[],[f67])).
% 0.12/0.34 % SZS output end Proof for Vampire---4
% 0.12/0.34 % (30762)------------------------------
% 0.12/0.34 % (30762)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.12/0.34 % (30762)Termination reason: Refutation
% 0.12/0.34
% 0.12/0.34 % (30762)Memory used [KB]: 5500
% 0.12/0.34 % (30762)Time elapsed: 0.005 s
% 0.12/0.34 % (30762)Instructions burned: 5 (million)
% 0.12/0.34 % (30762)------------------------------
% 0.12/0.34 % (30762)------------------------------
% 0.12/0.34 % (30755)Success in time 0.015 s
% 0.12/0.34 % Vampire---4.8 exiting
%------------------------------------------------------------------------------